Boneh-Gentry-Hamburg's Identity-based Encryption Schemes Revisited

An Efficient Variant of Boneh-Gentry-Hamburg's Identity-Based Encryption Without Pairing

Space-Efficient Identity-Based Encryption: Spelling out the Approach by Boneh-Gentry-Hamburg

Identity-based encryption (also known as IBE) is a type of public key cryptography in which the public key of a user is some unique information about his identity. The initial motivation to the creation of IBE was to simplify key management in email systems. An open problem was the creation of a space-efficient IBE scheme that was not based in pairings on elliptic curves. Boneh, Gentry and Hamb...

Boneh-Franklin Identity Based Encryption Revisited

The first practical identity based encryption (IBE) scheme was proposed by Boneh and Franklin in [BF03]. In this work we point out that there is a flawed step in the security reduction exhibited by the authors. Fortunately, it is possible to fix it without changing the scheme or the underlying assumption. In the second place, we introduce a variant of the seminal IBE scheme which allows a more ...

New Efficient Identity-Based Encryption From Factorization

Identity Based Encryption (IBE) systems are often constructed using pairings or lattices. Three exceptions are due to Cocks in 2001, Boneh, Gentry and Hamburg in 2007, and Paterson and Srinivasan in 2009. The main goal of this paper to propose new IBE schemes, which may give a way to find IBEs without pairing or lattice. Essentially, the security of our IBE schemes is rooted in the intractabili...

Identity-Based Online/Offline Encryption

We consider a scenario of identity-based encryption (IBE) where the encryption device (such as a smartcard) has low power. To improve the computation efficiency, it is desirable that part of computation can be done prior to knowing the message and the recipient (its identity or public key). The real encryption can be conducted efficiently once the message and the recipient’s identity become ava...